Block-circulant complex Hadamard matrices

نویسندگان

چکیده

A new method of obtaining a sequence isolated complex Hadamard matrices (CHM) for dimensions $N\geqslant 7$, based on block-circulant structures, is presented. We discuss, several analytic examples resulting from modification the Sinkhorn algorithm. In particular, we present orders $9$, $10$ and $11$, which elements are not roots unity, also multiparametric families order $10$. note novel connections between certain eight-dimensional provide insights towards classification CHM 7$. These contributions can find real applications in Quantum Information Theory constructions Mutually Unbiased Bases or Unitary Error Bases.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Circulant Hadamard Matrices

Note. The determinant of a circulant matrix is an example of a group determinant, where the group is the cyclic group of order n. In 1880 Dedekind suggested generalizing the case of circulants (and more generally group de­ terminants for abelian groups) to arbitrary groups. It was this suggestion that led Frobenius to the creation group of representation theory. See [1] and the references therein.

متن کامل

On the nonexistence of Hermitian circulant complex Hadamard matrices

We prove that there is no circulant Hermitian complex Hadamard matrix of order n > 4.

متن کامل

Small circulant complex Hadamard matrices of Butson type

We study the circulant complex Hadamard matrices of order n whose entries are l-th roots of unity. For n = l prime we prove that the only such matrix, up to equivalence, is the Fourier matrix, while for n = p+ q, l = pq with p, q distinct primes there is no such matrix. We then provide a list of equivalence classes of such matrices, for small values of n, l.

متن کامل

Double Wieferich Pairs and Circulant Hadamard Matrices

We show that all but 4489 integers n with 4 < n ≤ 4 ·1030 cannot occur as the order of a circulant Hadamard matrix. Our algorithm allows us to search 10000 times farther than prior efforts, while substantially reducing memory requirements. The principal improvement over prior methods involves the incorporation of a separate search for double Wieferich prime pairs {p, q}, which have the property...

متن کامل

Hadamard ideals and Hadamard matrices with two circulant cores

We apply Computational Algebra methods to the construction of Hadamard matrices with two circulant cores, given by Fletcher, Gysin and Seberry. We introduce the concept of Hadamard ideal for this construction to systematize the application of Computational Algebra methods. Our approach yields an exhaustive search construction of Hadamard matrices with two circulant cores for this construction f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Physics

سال: 2023

ISSN: ['0022-2488', '1527-2427', '1089-7658']

DOI: https://doi.org/10.1063/5.0144667